package com.zac.coroutine.algorithm.leetcode.tree

import kotlin.random.Random

/**
 * author zac
 * date 2024/11/20
 *
 */
class TreeTest {


    companion object {
        @JvmStatic
        fun main(args: Array<String>) {
            val bst = BST()

            for (i in 0 until 10) {

                val n =Random.Default.nextInt(0,100)
                bst.add(BST.Node(n, null, null))
                print("$n,")
            }
            println()

//            bst.preOrder()
//            bst.inOrder()
            bst.postOrder()


        }
    }

}